topic model link document updat rule estim latent topic model plai import role unsupervis learn corpu probabilist interpret corpu term latent topic space underpin assumpt topic model base document assum independ assumpt hold true realiti relat document wai citat relat research paper address limit paper present bernoulli process topic bpt model interdepend document model random bernoulli process bpt model document model distribut topic mixtur distribut relat document bpt aim obtain document model incorpor relat document appli applic includ detect topic corpora cluster document appli bpt model document collect experiment comparison state art approach demonstr promis perform facetcub framework incorpor prior knowledg dneg tensor factor direct network commun detect popular product link model paper problem commun detect direct network probabilist model exist probabilist model commun detect symmetr incom link outgo link treat equal condit type incom outgo link model present probabilist model direct network commun detect aim model incom link outgo link simultan differenti introduc latent variabl node product node popular explicitli captur outgo link incom link demonstr gener propos framework show symmetr model condit model commun detect deriv propos framework special case lead understand exist model deriv effici em algorithm comput maximum likelihood solut propos model extens empir studi verifi effect model insight obtain unifi framework unsupervis learn link document latent topic model plai import role unsupervis learn corpu probabilist interpret corpu term latent topic space underpin assumpt topic model base document assum independ assumpt hold true realiti relat document wai citat relat research paper address limit paper present bernoulli process topic bpt model interdepend document model random bernoulli process bpt model document model distribut topic mixtur distribut relat document bpt aim obtain document model incorpor relat document appli applic includ detect topic corpora cluster document appli bpt model document collect experiment comparison state art approach demonstr promis perform direct network commun detect popular product link model paper problem commun detect direct network probabilist model exist probabilist model commun detect symmetr incom link outgo link treat equal condit type incom outgo link model present probabilist model direct network commun detect aim model incom link outgo link simultan differenti introduc latent variabl node product node popular explicitli captur outgo link incom link demonstr gener propos framework show symmetr model condit model commun detect deriv propos framework special case lead understand exist model deriv effici em algorithm comput maximum likelihood solut propos model extens empir studi verifi effect model insight obtain unifi framework clouddb size fit reviv sla dawar profit optim cloud servic resourc schedul increment spectral cluster effici updat eigen dsystem knowledg discoveri citat network abstract knowledg discoveri scientif articl receiv increas attent recent huge repositori made develop internet digit databas corpu scientif articl digit librari document connect citat document plai role corpu document citat document exist topic model effort made differenti role topic distribut role relat paper propos bernoulli process topic bpt model model corpu level document level citat level bpt model document represent latent topic space role multilevel hierarch structur citat network captur gener process involv bernoulli process distribut paramet bpt model estim variat approxim approach addit conduct experiment evalu document model task appli bpt model scientif corpu discov latent topic comparison state ofth art method demonstr promis perform keyword unsupervis learn latent model text mine combin link content commun detect discrimin approach order innov laggard product categor recommend buyer exhibit purchas behavior rush purchas product tend cautiou wait review peopl trust market analysi group buyer refer innov earli adopt group refer laggard adopt behavior dynam featur user vari group product innov literatur innov electron adopt order user dynam featur product predict futur potenti buyer dynam featur unavail descript product paper studi user behavior onlin review websit epinion propos model user adopt behavior creat total order user rate product categori develop greedi algorithm markov chain base algorithm comput categori total order show user behavior inform accur predict categori product predict user follow epinion trust network evid demonstr total order group user commun close resembl trust network adopt order featur recommend system bayesian approach find commun evolut dynam social network latent topic model link document associ rule mine stream im set item stream transact sequenti order transact subset itemset subset transact itemset support defin fraction transact support threshold frequent support greater equal transact confid threshold associ rule hold frequent transact problem associ rule mine stream discov associ rule hold stream transact histor background rakesh agraw al propos framework associ rule mine semin work lot research improv effici associ rule mine algorithm extend definit associ rule appli associ rule mine analyz commun evolut dynam social network evolutionari spectral cluster evolutionari cluster emerg research area essenti import applic cluster dynam web blog content cluster data stream evolutionari cluster good cluster result fit current data simultan deviat dramat recent histori fulfil dual purpos measur tempor smooth integr measur cluster qualiti articl propos framework incorpor tempor smooth evolutionari spectral cluster framework start intuit gain mean cluster problem propos solv cost function evolutionari spectral cluster problem solut evolutionari spectral cluster problem provid stabl consist cluster result sensit short term nois time adapt longterm cluster drift demonstr method provid optim solut relax version evolutionari mean cluster problem perform experi number real synthet data set illustr evolutionari spectral cluster method provid robust cluster result sensit nois adapt data drift integr cluster multi ddocument summar improv document understand document understand techniqu document cluster multi document summar receiv attent recent year current document cluster method repres document term document matrix perform cluster algorithm cluster method group document satisfactorili hard peopl captur mean document satisfactori interpret document cluster paper propos languag model simultan cluster summar document util mutual influenc document cluster summar method make document cluster method meaning interpret document summar method take document context inform consider probabilist polyad factor applic person recommend multipl dimension polyad data exist applic person recommend multipledimension data summar analyz dimens polyad data principl challeng research problem exist method separ analyz margin relationship pairwis dimens combin result motiv fact dimens polyad data jointli affect propos probabilist polyad factor approach directli model dimens simultan unifi framework show connect probabilist polyad factor neg version tucker tensor factor provid detail theoret analysi model framework discuss implement techniqu model propos extens basic framework appli propos model applic person recommend extens experi social bookmark dataset delici paper citat dataset cites demonstr effect propos model effici comput person aggreg queri blog explod amount user gener content web due emerg web servic blogger myspac flickr del icio particip larg number user share opinion web inspir research build effect inform filter aggreg independ opinion divers group user web nowadai global aggreg inform interest group user paper explor possibl comput person aggreg opinion express web base user indic trust inform sourc hope emploi person aggreg make recommend interest user address challeng scalabl issu propos effici method util core techniqu neg matrix factor threshold algorithm comput person aggreg potenti million user million sourc system show experi real life dataset person aggreg approach make signific differ item recommend reduc queri comput cost significantli result person aggreg accur facetnet framework analyz commun evolut dynam network discov commun social network data analyz commun evolut commun inher characterist human interact onlin social network paper citat network commun evolv time due individu role social statu network individu research interest present innov algorithm deviat tradit step approach analyz commun evolut tradit approach commun detect time slice compar determin correspond argu approach inappropri applic noisi data paper propos facetnet analyz commun evolut robust unifi detect splog tempor dynam dsimilar analysi articl address problem spam blog splog detect tempor structur regular content post time link splog undesir blog meant attract search engin traffic sole promot affili site blog repres popular onlin media splog degrad qualiti search engin result wast network resourc splog detect problem made difficult due lack stabl content descriptor develop techniqu detect splog base observ blog dynam grow sequenc entri post collect individu page approach splog recogn tempor characterist content kei idea splog detect framework repres blog tempor dynam selfsimilar matric defin histogram intersect similar measur time content link attribut post investig tempor post sequenc studi blog tempor characterist visual represent deriv similar measur visual signatur reveal correl attribut post depend type blog normal blog splog propos type tempor featur captur splog tempor characterist splog detector featur combin splog detect dsimilar analysi blog tempor dynam paper focus spam blog splog detect blog highli popular media social commun mechan presenc splog degrad blog search result wast network resourc approach exploit uniqu blog tempor dynam detect splog kei idea splog detect framework repres blog tempor dynam similar matric defin histogram intersect similar measur time content link attribut post show visual blog tempor characterist reveal attribut correl depend type blog normal blog splog propos tempor structur properti comput similar matric attribut splog detector featur combin content base featur extract content base featur vector part blog url post content dimension featur vector reduc fisher linear discrimin analysi test svm base splog detector propos featur real world dataset excel result accuraci identifi opinion leader blogospher opinion leader bring inform idea opinion dissemin mass influenc opinion decis fashion word mouth opinion leader captur repres opinion social network import understand massiv complex blogospher paper propos algorithm call influencerank identifi opinion leader blogospher influencerank algorithm rank blog import compar blog inform contribut network experiment result propos algorithm effect identifi influenti opinion leader identifi opinion leader blogospher opinion leader bring inform idea opinion dissemin mass influenc opinion decis fashion word mouth opinion leader captur repres opinion social network import understand massiv complex blogospher paper propos algorithm call influencerank identifi opinion leader blogospher influencerank algorithm rank blog import compar blog inform contribut network experiment result propos algorithm effect identifi influenti opinion leader splog detect content time link structur paper focus spam blog splog detect blog highli popular media social commun mechan splog corrupt blog search result wast network resourc approach exploit uniqu blog tempor dynam detect splog kei idea splog exhibit high tempor regular content post time consist link pattern tempor content regular detect autocorrel post content tempor structur regular determin entropi post time differ distribut link regular comput hit base hub score measur experi base annot ground truth real world dataset show excel result splog detect task accuraci evolutionari spectral cluster incorpor tempor smooth structur tempor analysi blogospher commun factor blogospher uniqu structur tempor properti blog typic commun media human individu paper propos techniqu captur structur tempor dynam blog commun framework commun set blog commun trigger event new articl commun repres structur tempor dynam commun graph blog commun commun intens activ level commun vari time method commun factor extract commun blogospher commun blog observ set subgraph thread discuss commun extract formul factor problem framework constrain optim object explain observ interact blogospher time provid scalabl algorithm comput solut constrain optim problem extens experiment studi synthet real blog data demonstr techniqu discov meaning commun detect tradit method increment spectral cluster applic monitor evolv blog commun recent year spectral cluster method gain attent superior perform compar tradit cluster algorithm mean algorithm exist spectral cluster algorithm line algorithm increment updat cluster result small chang data set capabl increment updat essenti applic real time monitor evolv commun webspher blogspher unlik tradit stream data applic requir increment algorithm handl insert delet data point similar exist item paper extend standard spectral cluster evolv data introduc incid vector matrix repres kind dynam framework increment updat eigenvalu system increment algorithm initi standard spectral cluster continu effici updat eigenvalu system gener instant cluster label data set evolv algorithm appli blog data set compar recomput solut standard spectral cluster achiev similar accuraci lower comput cost close inspect blog content show increment approach discov stabl blog commun evolut individu multi topic blog captur user interest exploit explor inform flow model base diffus rate predict rank address problem rank question answer credibl character probabl question answer user award answer question answer question answer histori probabl repres consid hidden variabl estim statist specif observ user number answer award number question answer specif problem address potenti high degre uncertainti credibl estim base small number answer address problem kind bayesian smooth credibl estim consist mixtur popul statist specif user greater number question ask greater contribut specif user statist rel popul predict stochast complex psc accuraci measur evalu method estim compar techniqu bayesian smooth bs maximum priori map estim maximum likelihood ml estim laplac smooth eigen dtrend trend analysi blogospher base singular decomposit blogospher total blog relat web site great sourc trend analysi area product survei custom relationship market exist approach base simpl count number entri number link paper introduc concept coin eigen trend repres tempor trend group blog common interest propos techniqu extract eigentrend blog propos trend analysi techniqu base singular decomposit extract eigentrend provid insight multipl trend keyword propos trend analysi techniqu base higher order singular decomposit analyz blogospher dynam graph structur extract eigen trend reflect structur blogospher time experiment studi base synthet data set real blog data set show techniqu reveal lot interest trend inform insight blogospher obtain tradit count base method blog commun discoveri evolut base mutual awar expans inform involv costli decis effici satisfi convent web search engin altern commun centric search provid multipl viewpoint facilit decis make propos discov model tempor dynam themat commun base mutual awar awar aris due observ blogger action expans mutual awar lead commun format queri construct direct action graph time depend weight respect queri model process mutual awar expans random walk process extract commun base model propos interact space base represent quantifi commun dynam commun repres vector interact space evolut determin interact correl method conduct experi real world blog dataset promis result detect insight result commun evolut eigen dtrend trend analysi blogospher base singular decomposit blogospher total blog relat web site great sourc trend analysi area product survei custom relationship market exist approach base simpl count number entri number link paper introduc concept coin eigen trend repres tempor trend group blog common interest propos techniqu extract eigentrend blog propos trend analysi techniqu base singular decomposit extract eigentrend provid insight multipl trend keyword propos trend analysi techniqu base higher order singular decomposit analyz blogospher dynam graph structur extract eigen trend reflect structur blogospher time experiment studi base synthet data set real blog data set show techniqu reveal lot interest trend inform insight blogospher obtain tradit count base method splog detect task solut base tempor link properti spam blog splog major problem increasingli popular blogospher splog detriment corrupt qualiti inform retriev wast tremend network storag resourc studi research issu splog detect comparison web spam email spam identifi uniqu characterist splog propos onlin task captur uniqu characterist splog addit task base tradit ir evalu framework task introduc time sensit detect evalu quickli detector identifi splog propos splog detect algorithm combin tradit content featur tempor link regular featur uniqu blog final develop annot tool gener ground truth sampl subset trec blog dataset conduct experi offlin tradit splog detect propos onlin splog detect task experi base annot ground truth set show excel result offlin onlin splog detect task catch moment maintain close frequent itemset data stream slide window paper consid problem mine close frequent itemset data stream slide window limit memori space design synopsi data structur monitor transact slide window output current close frequent itemset time due time memori constraint synopsi data structur monitor itemset monitor frequent itemset make imposs detect itemset frequent paper introduc compact data structur close enumer tree cet maintain dynam select set itemset slide window select itemset boundari close frequent itemset rest itemset concept drift data stream reflect boundari movement cet word statu chang itemset frequent frequent occur boundari loadstar load shed scheme classifi data stream problem resourc alloc mine multipl data stream due larg volum high speed stream data mine algorithm cope ect system overload realiz maximum mine benefit resourc constraint challeng task paper propos load shed scheme classifi multipl data stream focu problem classifi data drop load shed scheme ii decid drop data stream introduc qualiti decis qod metric measur level uncertainti classif exact featur valu data load shed markov model predict distribut featur valu make classif decis predict valu qod metric resourc alloc multipl data stream maxim qualiti classif decis load shed scheme learn adapt chang data characterist data stream experi synthet data real life data show load shed scheme ectiv improv accuraci classif resourc constraint keyword data mine data stream load shed classif qualiti decis featur predict markov model loadstar load shed data stream mine demo show intellig load shed essenti achiev optimum result mine data stream resourc constraint loadstar system introduc load shed techniqu classifi multipl data stream larg volum high speed loadstar metric qualiti decis qod measur level uncertainti classif resourc alloc sourc uncertainti high make optimum classif decis accur qod measur loadstar reli featur predict model data drop load shed mechan loadstar adapt chang data characterist data stream system offer nice solut data mine resourc constraint frequent subtre mine overview mine frequent subtre databas label tree research field practic applic area comput network web mine bioinformat xml document mine applic share requir express power label tree captur complex relat data entiti frequent subtre mine difficult task frequent itemset mine exist frequent subtre mine algorithm borrow techniqu matur associ rule mine area paper overview broad rang tree mine algorithm focu common theoret foundat current frequent subtre mine algorithm relationship counterpart frequent itemset mine compar algorithm categor problem definit techniqu emploi solv subtask subtre mine problem addit present perform studi repres famili algorithm correct mine close maxim frequent subtre databas label root tree abstract tree structur extens domain comput biologi pattern recognit xml databas comput network import problem mine databas tree find frequent occur subtre combinatori explos number frequent subtre grow exponenti size frequent subtre mine frequent subtre infeas larg tree size paper present cmtreemin computation effici algorithm discov close maxim frequent subtre databas label root tree root tree order unord algorithm mine close maxim frequent subtre travers enumer tree systemat enumer frequent subtre techniqu propos prune branch enumer tree correspond close maxim frequent subtre heurist techniqu arrang order comput expens comput avoid studi perform algorithm extens experi synthet data data set real applic experiment result show algorithm effici reduc search space quickli discov close maxim frequent subtre index term tree graph algorithm data mine mine method algorithm frequent subtre close frequent subtre maxim frequent subtre mine close maxim frequent subtre databas label root tree abstract tree structur extens domain comput biologi pattern recognit xml databas comput network import problem mine databas tree find frequent occur subtre combinatori explos number frequent subtre grow exponenti size frequent subtre mine frequent subtre infeas larg tree size paper present cmtreemin computation effici algorithm discov close maxim frequent subtre databas label root tree root tree order unord algorithm mine close maxim frequent subtre travers enumer tree systemat enumer frequent subtre techniqu propos prune branch enumer tree correspond close maxim frequent subtre heurist techniqu arrang order comput expens comput avoid studi perform algorithm extens experi synthet data data set real applic experiment result show algorithm effici reduc search space quickli discov close maxim frequent subtre index term tree graph algorithm data mine mine method algorithm frequent subtre close frequent subtre maxim frequent subtre canon form label tree applic frequent subtre mine tree structur extens domain comput biologi pattern recognit xml databas comput network paper present canon form label root unord tree breadth canon form bfcf depth canon form dfcf canon form appli frequent subtre mine problem base bfcf develop vertic mine algorithm rootedtreemin discov frequent occur subtre databas label root unord tree rootedtreemin algorithm enumer tree enumer frequent label root unord subtre extend definit dfcf label free tree present apriori algorithm freetreemin discov frequent occur subtre databas label free tree final studi perform scalabl algorithm extens experi base synthet data dataset real applic mine associ rule duniform privaci concern privaci concern import issu data mine popular preserv privaci random dataset mine systemat mine random dataset hand peopl privaci concern attribut data survei data sensit question vari inform lead accur data mine result inform fulli util privaci preserv associ rule mine algorithm paper gener privaci preserv associ rule mine problem allow attribut level privaci random factor valu attribut random process propos effici algorithm recurs estim estim support itemset framework theoret empir result show uniform random factor improv accuraci support estim compar conserv random factor moment maintain close frequent itemset stream slide window paper consid problem mine close frequent itemset slide window limit memori space design synopsi data structur monitor transact slide window output current close frequent itemset time due time memori constraint synopsi data structur monitor itemset monitor frequent itemset make imposs detect itemset frequent paper introduc compact data structur close enumer tree cet maintain dynam select set itemset slide window select itemset consist boundari close frequent itemset rest itemset concept drift data stream reflect boundari movement cet word statu chang itemset frequent frequent occur boundari boundari stabl cost mine close frequent itemset slide window dramat reduc mine transact possibl boundari movement cet experi show algorithm perform previou approach cmtreemin mine close maxim frequent subtre tree structur extens domain comput biologi pattern recognit xml databas comput network import problem mine databas tree find frequent occur subtre combinatori explos number frequent subtre grow exponenti size subtre paper present cmtreemin computation cient algorithm discov close maxim frequent subtre databas root unord tree algorithm mine close maxim frequent subtre travers enumer tree systemat enumer subtre enumer dag prune branch enumer tree correspond close maxim frequent subtre enumer tree enumer dag defin base canon form root unord tree depth canon form dfcf hybridtreemin effici algorithm mine frequent root tree free tree canon form tree structur extens domain comput biologi pattern recognit xml databas comput network paper present hybridtreemin computation effici algorithm discov frequent occur subtre databas root unord tree algorithm mine frequent subtre travers enumer tree systemat enumer subtre enumer tree defin base canon form root unord tree breadth canon form bfcf extend definit canon form enumer tree free tree algorithm effici handl databas free tree studi perform algorithm extens experi base synthet data dataset real applic experi show algorithm competit comparison root tree mine algorithm faster order magnitud compar algorithm mine frequent free tree index mine free tree tree structur extens domain comput biologi pattern recognit comput network paper present index techniqu free tree appli index techniqu problem mine frequent subtre defin represent canon form root tree extend definit free tree introduc concept canon string simpler represent free tree canon form appli tree index techniqu frequent subtre mine problem present freetreemin computation cient algorithm discov frequent occur subtre databas free tree mine algorithm variat tradit priori method mine frequent itemset studi perform scalabl algorithm extens experi base synthet data dataset real applic dataset chemic compound dataset internet multicast tree experi show algorithm scale linearli cardin databas 